Convex Hulls in a 3-Dimensional Space

نویسندگان

  • Vladimir Kovalevsky
  • Henrik Schulz
چکیده

This paper describes a new algorithm of computing the convex hull of a 3-dimensional object. The convex hull generated by this algorithm is an abstract polyhedron being described by a new data structure, the cell list, suggested by one of the authors. The correctness of the algorithm is proved and experimental results are presented.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On Young Hulls of Convex Curve in R

For a convex curve in an even-dimensional affine space we introduce a series of convex domains (called Young hulls) describe their structure and give a formulas fo the volume of the biggest of these domains.

متن کامل

Solving Geometric Problems in Space-Conscious Models

When dealing with massive data sets, standard algorithms may easily “run out of memory”. In this thesis, we design efficient algorithms in space-conscious models. In particular, in-place algorithms, multi-pass algorithms, read-only algorithms, and stream-sort algorithms are studied, and the focus is on fundamental geometric problems, such as 2D convex hulls, 3D convex hulls, Voronoi diagrams an...

متن کامل

An Optimal Algorithm for Intersecting Three-Dimensional Convex Polyhedra

This paper describes a linear-time algorithm for computing the intersection of two convex polyhedra in 3-space. Applications of this result to computing intersections, convex hulls, and Voronoi diagrams are also given.

متن کامل

White Space Regions

We study a classical problem in communication and wireless networks called Finding White Space Regions. In this problem, we are given a set of antennas (points) some of which are noisy (black) and the rest are working fine (white). The goal is to find a set of convex hulls with maximum total area that cover all white points and exclude all black points. In other words, these convex hulls make i...

متن کامل

Convex Hulls in Concept Induction

Classi cation learning is dominated by systems which induce large num bers of small axis orthogonal decision surfaces This strongly biases such systems towards particular hypothesis types but there is reason believe that many domains have underlying concepts which do not involve axis orthog onal surfaces Further the multiplicity of small decision regions mitigates against any holistic appreciat...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2004